Rational subsets of partially reversible monoids
نویسنده
چکیده
A class of monoids that can model partial reversibility allowing simultaneously instances of two-sided reversibility, one-sided reversibility and no reversibility is considered. Some of the basic decidability problems involving their rational subsets, syntactic congruences and characterization of recognizability, are solved. Recognizability of rational subsets is also proved to be decidable for the wider class of monoids defined through finite monadic confluent rewriting systems.
منابع مشابه
ar X iv : 0 71 0 . 37 11 v 1 [ m at h . R A ] 1 9 O ct 2 00 7
We study the classes of languages defined by valence automata with rational target sets (or equivalently, regular valence grammars with rational target sets), where the valence monoid is drawn from the important class of polycyclic monoids. We show that for polycyclic monoids of rank 2 or more, such automata accept exactly the context-free languages. For the polycyclic monoid of rank 1 (that is...
متن کاملThe "Last" Decision Problem for Rational Trace Languages
It is established here that it is decidable whether a rational set of a free partially commutative monoid (i.e. trace monoid) is recognizable or not if and only if the commutation relation is transitive (i.e. if the trace monoid is isomorphic to a free product of free commutative monoids). The bulk of the paper consists in a characterization of recognizable sets of free products via generalized...
متن کاملRecent Results in the Theory of Rational Sets
This paper presents a survey of recent results in the theory of rational sets in arbitrary monoids. Main topics considered here are : the so-called Kleene monoids (i.e. monoids where Kleene's theorem holds), rational functions and relations, rational sets in partially commutative monoids, and rational sets in free groups.
متن کاملPartially Commutative Inverse Monoids
Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoids are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented, more precisely, we give an O(n log(n)) algorithm for...
متن کاملSeparability of rational subsets by recognizable subsets is decidable in A∗ × N
Given a direct product of monoids M = A∗ ×N where A is finite and N is the additive monoid of nonnegative integers, the following problem is recursively decidable: given two rational subsests of M , does there exist a recognizable subset which includes one of the subsets and excludes the other.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 409 شماره
صفحات -
تاریخ انتشار 2008